ABSTRACT
The protection on many public key encoding schemes depended on the intractability of detecting the integer
factoring problem such as RSA scheme. However, there are great deals of researches regarding the RSA factoring
modulus compared with the other type of attack the RSA scheme. So the need for more methods of attacks other
than RSA factoring modulus to find an effective and quicker algorithm to solve this problem is still crucial.
This paper introduces a new algorithmic program which approaches the RSA scheme. The suggested algorithm
aims to find the private key of the RSA scheme and then factoring the modulus based on the public key of the RSA
scheme. The new idea exacted to be more efficient than the already existed algorithms particularly when the
public key is small, since most of public key encryption schemes select a small public encryption key e in order to
improve the efficiency of encryption. Also, the suggested algorithmic program is more effective since it is faster
and takes less running time.
Keywords: - Public key cryptography, RSA scheme, factoring problem, RSA attack scheme